A Fast Approximation Algorithm for the Subset-Sum Problem
نویسنده
چکیده
The subset-sum problem (SSP) is deened as follows: given a positive integer bound and a set of n positive integers nd a subset whose sum is closest to, but not greater than, the bound. We present a randomized approximation algorithm for this problem with linear space complexity and time complexity of O(n log n). Experiments with random uniformly-distributed instances of SSP show that our algorithm outperforms, both in running time and average error, Martello and Toth's MT84] quadratic greedy search, whose time complexity is O(n 2). We propose conjectures on the expected error of our algorithm for uniformly-distributed instances of SSP and provide some analytical arguments justifying these conjectures. We present also results of numerous tests.
منابع مشابه
Linear-time approximation algorithms for minimum subset sum and subset sum
We present a family of approximation algorithms for minimum subset sum with a worst-case approximation ratio of (k + 1)/k and which run in linear time assuming that k is constant. We also present a family of linear-time approximation algorithms for subset sum with worst-case approximation factors of k/(k+1) assuming that k is constant. The algorithms use approaches from and improve upon previou...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملA Fast Heuristic Algorithm for Solving High-Density Subset-Sum Problems
The subset sum problem is to decide whether for a given set of integers A and an integer S, a possible subset of A exists such that the sum of its elements is equal to S. The problem of determining whether such a subset exists is NP-complete; which is the basis for cryptosystems of knapsack type. In this paper a fast heuristic algorithm is proposed for solving subset sum problems in pseudo-poly...
متن کامل